package com.gxgeek.algorithm.sort;

/**
 * Created by gx on 2017/4/26.
 */
public class SimpleSort {


    public static void sort(long [] arr){
        long temp ;
        for ( int i = 0 ; i<arr.length;i++){
            for (int j = arr.length - 1; j>1;j++){
                if (arr[j] < arr [j-1]) {
                   temp = arr[j];
                   arr[j] = arr [j-1];
                   arr[j-1]= temp;
                }
            }
        }
    }


}
